Dependency Chart Parsing Algorithm Based on Ternary-Span Combination
نویسندگان
چکیده
منابع مشابه
Span-based Statistical Dependency Parsing of Chinese
Using non-constituent spans, we have applied the CYK algorithm to statistical dependency parsing of Chinese, with an additional measure to avoid duplicated e orts. We used a rule-based Chinese parser to generate a training corpus of functionally labelled dependency annotations. In this paper, we describe our span-based CYK algorithm and report initial experimental results.
متن کاملBeyond Chart Parsing: An Analytic Comparison of Dependency Chart Parsing Algorithms
In this paper, we give a summary of various dependency chart parsing algorithms in terms of the use of parsing histories for a new dependency arc decision. Some parsing histories are closely related to the target dependency arc, and it is necessary for the parsing algorithm to take them into consideration. Each dependency treebank may have some unique characteristics, and it requires for the pa...
متن کاملDependency Parsing by Transformation and Combination
This study presents new language and treebank independent graph transformations that improve accuracy in data-driven dependency parsing. We show that individual generic graph transformations can increase accuracy across treebanks, but especially when they are combined using established parser combination techniques. The combination experiments also indicate that the presumed best way to combine...
متن کاملMemory-Based Dependency Parsing
This paper reports the results of experiments using memory-based learning to guide a deterministic dependency parser for unrestricted natural language text. Using data from a small treebank of Swedish, memory-based classifiers for predicting the next action of the parser are constructed. The accuracy of a classifier as such is evaluated on held-out data derived from the treebank, and its perfor...
متن کاملLayer-Based Dependency Parsing
In this paper, a layer-based projective dependency parsing approach is presented. This novel approach works layer by layer from the bottom up. Inside the layer the dependency graphs are searched exhaustively while between the layers the parser state transfers deterministically. Taking the dependency layer as the parsing unit, the proposed parser has a lower computational complexity than graph-b...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEICE Transactions on Information and Systems
سال: 2013
ISSN: 0916-8532,1745-1361
DOI: 10.1587/transinf.e96.d.93